Tootfinder

I’ve missed my calling as an interior decorator, I think.
#TealLensman

i think this poster is by far the most useful thing i saw in my decade working for siemens.
(see alt-text for a transcript)
this is genuine and was all over all sites back in those days.
also: yes, i was having loads of fun insisting on following the recommendations of the notes...

Naturally I drink more #coffee in the winter months. #Underground #data

Hey friends! my #prints arrived earlier than expected! I chose 30x30cm for each print and have them on my walls now. Definitely a good choice! ❤❤❤
All four are from my own #hiking trips and you might have seen them already. I am absolutely happy that I chose those.
I put them on FAA as we…

Franz Graf - Artwork Collection: 4 Squares
Browse through images in Franz Graf's 4 Squares collection. These are 4 Squares that I decided to have on my own walls

Hourly commits to the @… github repo is really juicing my profile.
https://github.com/stefanhayden

stefanhayden - Overview
stefanhayden has 47 repositories available. Follow their code on GitHub.

"The tiles of Alhambra" with #turtlestitch
The design is based on a tile pattern in the Nasrid Palace complex near Granada/Spain. It can be found in a meeting place called The Mexuar.
I'm curious how it will work out on the machine #embroidery

reading now: I somehow missed Poul Anderson reading sci-fi as a kid but I’ve lately gotten into his works, particularly the Dominic Flandry books like “Agent of the Terran Empire”
#books #reading #scifi

Bravissimo Italy!
This map shows, for 17,600 fuel stations, the possibility of connecting to the grid, providing developers with valuable information at a glance on the feasibility, timing and costs associated with installing different types of #EV chargers at these locations.
#evcharging <…

Distributed Least Squares in Small Space via Sketching and Bias Reduction
Sachin Garg, Kevin Tan, Micha{\l} Derezi\'nski
https://arxiv.org/abs/2405.05343

Distributed Least Squares in Small Space via Sketching and Bias Reduction
Matrix sketching is a powerful tool for reducing the size of large data matrices. Yet there are fundamental limitations to this size reduction when we want to recover an accurate estimator for a task such as least square regression. We show that these limitations can be circumvented in the distributed setting by designing sketching methods that minimize the bias of the estimator, rather than its error. In particular, we give a sparse sketching method running in optimal space and current matrix …

If someone wants to know when to come and rob my house, just follow my github profile and check for consecutive blank squares.

Cool! That's from the official @… app 😎

This https://arxiv.org/abs/2305.11763 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Cliques in Squares of Graphs with Maximum Average Degree less than 4
Hocquard, Kim, and Pierron constructed, for every even integer $D\ge 2$, a 2-degenerate graph $G_D$ with maximum degree $D$ such that $ω(G_D^2)=\frac52D$. We prove for (a) all 2-degenerate graphs $G$ and (b) all graphs $G$ with $\mbox{mad}(G)<4$, upper bounds on the clique number $ω(G^2)$ of $G^2$ that match the lower bound given by this construction, up to small additive constants. We show that if $G$ is 2-degenerate with maximum degree $D$, then $ω(G^2)\le \frac52D+72$ (with $ω(G^2)\le \f…

Dan Charnas: Dilla Time (2022)

If someone wants to know when to come and rob my house, just follow my github profile and check for consecutive blank squares.

Cool! That's from the official @… app 😎

This https://arxiv.org/abs/2302.13616 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

ResQPASS: an algorithm for bounded variable linear least squares with asymptotic Krylov convergence
We present the Residual Quadratic Programming Active-Set Subspace (ResQPASS) method that solves large-scale linear least-squares problems with bound constraints on the variables. The problem is solved by creating a series of small problems of increasing size by projecting on the basis of residuals. Each projected problem is solved by the active-set method for convex quadratic programming, warm-started with a working set and solution of the previous problem. The method coincides with conjugate g…

This https://arxiv.org/abs/2311.03164 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_ees…

A contract negotiation scheme for safety verification of interconnected systems
This paper proposes a (control) barrier function synthesis and safety verification scheme for interconnected nonlinear systems based on assume-guarantee contracts (AGC) and sum-of-squares (SOS) techniques. It is well-known that the SOS approach does not scale well for barrier function synthesis for high-dimensional systems. In this paper, we show that compositional methods like AGC can mitigate this problem. We formulate the synthesis problem into a set of small-size problems, which constructs …

This https://arxiv.org/abs/2309.14788 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csDS_…

Small-Space Algorithms for the Online Language Distance Problem for Palindromes and Squares
We study the online variant of the language distance problem for two classical formal languages, the language of palindromes and the language of squares, and for the two most fundamental distances, the Hamming distance and the edit (Levenshtein) distance. In this problem, defined for a fixed formal language $L$, we are given a string $T$ of length $n$, and the task is to compute the minimal distance to $L$ from every prefix of $T$. We focus on the low-distance regime, where one must compute onl…

This https://arxiv.org/abs/2303.07983 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Parameter estimation of stochastic SIR model driven by small Lévy noise with time-dependent periodic transmission
We investigate the parameter estimation and prediction of two forms of the stochastic SIR model driven by small Lévy noise with time-dependent periodic transmission. We present consistency and rate of convergence results for the least-squares estimators. We include simulation studies using the method of projected gradient descent.

This https://arxiv.org/abs/2302.13616 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

ResQPASS: an algorithm for bounded variable linear least squares with asymptotic Krylov convergence
We present the Residual Quadratic Programming Active-Set Subspace (ResQPASS) method that solves large-scale linear least-squares problems with bound constraints on the variables. The problem is solved by creating a series of small problems of increasing size by projecting on the basis of residuals. Each projected problem is solved by the active-set method for convex quadratic programming, warm-started with a working set and solution of the previous problem. The method coincides with conjugate g…

Legendre Conjecture over Arithmetic Progressions
N. A. Carella
https://arxiv.org/abs/2403.19698 https://arxiv.org/pdf/2403.19698

Legendre Conjecture over Arithmetic Progressions
Let $1\leq a1$ be a large number. This note discusses the existence of a short sequence of primes $p\equiv a\bmod q$ between two squares $x^2$ and $(x+1)^2$.

Three-Dimensional Freeform Reflector Design with a Microfacet Surface Roughness Model
V\`i Kronberg, Martijn Anthonissen, Jan ten Thije Boonkkamp, Wilbert IJzerman
https://arxiv.org/abs/2403.00466

Three-Dimensional Freeform Reflector Design with a Microfacet Surface Roughness Model
This manuscript will unify inverse freeform reflector design and surface light scattering to design freeform reflectors with a scattering surface. We use microfacets, which are small, tilted mirrors superimposed on a smooth surface. We form a simple model of surface roughness and light scattering based on the orientations of the microfacets. Using a least-squares solver to compute the smooth reflector as a starting point, we can subsequently alter the surface using an optimization procedure to …

This https://arxiv.org/abs/2309.14788 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csDS_…

Small-Space Algorithms for the Online Language Distance Problem for Palindromes and Squares
We study the online variant of the language distance problem for two classical formal languages, the language of palindromes and the language of squares, and for the two most fundamental distances, the Hamming distance and the edit (Levenshtein) distance. In this problem, defined for a fixed formal language $L$, we are given a string $T$ of length $n$, and the task is to compute the minimal distance to $L$ from every prefix of $T$. We focus on the low-distance regime, where one must compute onl…

This https://arxiv.org/abs/2305.16420 has been replaced.
initial toot: https://mastoxiv.page/@arX…

Target-oriented least-squares reverse-time migration with Marchenko redatuming and double-focusing: Field data application
Recently, the focus of reflection seismologists has shifted to applications where a high-resolution image of the subsurface is required. Least-Squares Reverse-Time Migration (LSRTM) is a common tool used to compute such images. Still, its high computational costs have led seismologists to use target-oriented LSRTM for imaging only a small target of interest within a larger subsurface block. Redatuming the data to the upper boundary of the target of interest is one approach to target-oriented LS…

This https://arxiv.org/abs/2303.07983 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Parameter estimation of stochastic SIR model driven by small Lévy noise with time-dependent periodic transmission
We investigate the parameter estimation and prediction of two forms of the stochastic SIR model driven by small Lévy noise with time-dependent periodic transmission. We present consistency and rate of convergence results for the least-squares estimators. We include simulation studies using the method of projected gradient descent.

This https://arxiv.org/abs/2305.16420 has been replaced.
initial toot: https://mastoxiv.page/@arX…

Target-oriented least-squares reverse-time migration with Marchenko redatuming and double-focusing: Field data application
Recently, the focus of reflection seismologists has shifted to applications where a high-resolution image of the subsurface is required. Least-Squares Reverse-Time Migration (LSRTM) is a common tool used to compute such images. Still, its high computational costs have led seismologists to use target-oriented LSRTM for imaging only a small target of interest within a larger subsurface block. Redatuming the data to the upper boundary of the target of interest is one approach to target-oriented LS…